On the minmax regret path median problem on trees
نویسندگان
چکیده
منابع مشابه
The Minmax Regret Shortest Path Problem with Interval Arc Lengths
This paper considers the shortest path problem on directed acyclic graphs, where the uncertainty of input data (lengths of arcs) is modeled in the form of intervals. In order to handle the interval data the minmax criterion to the regret values is applied, where the original objective function with interval coefficients is transformed into that of finding the least maximum worst-case regret, wh...
متن کاملA Linear Approach to Node-restricted Minmax Regret Robust 1-median on a Tree
In this paper, we consider the node-restricted minmax regret 1-median problem on a tree network where node weights are deterministic and edge lengths are subject to uncertainty with unknown symmetric distribution. There have been proposed some complicated and time-consuming algorithms to obtain robust solutions for robust 1-median problem. We formulate the robust regret function as a mixed inte...
متن کاملThe permutation-path coloring problem on trees
In this paper we rst show that the permutation-path coloring problem is NP-hard even for very restrictive instances like involutions, which are permutations that contain only cycles of length at most two, on both binary trees and on trees having only two vertices with degree greater than two, and for circular permutations which are permutations that contain exactly one cycle on trees with maxim...
متن کاملOn the K shortest path trees problem
We address the problem for finding the K best path trees connecting a source node with any other non-source node in a directed network with arbitrary lengths. The main result in this paper is the proof that the kth shortest path tree is adjacent to at least one of the previous (k−1) shortest path trees. Consequently, we design an O(+Km) time and O(K+m) space algorithm to determine the K shortes...
متن کاملOn the approximability of minmax (regret) network optimization problems
In this paper the minmax (regret) versions of some basic polynomially solvable deterministic network problems are discussed. It is shown that if the number of scenarios is unbounded, then the problems under consideration are not approximable within logK for any ǫ > 0 unless NP ⊆ DTIME(n log ), where K is the number of scenarios.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2015
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2015.01.002